compress fisher linear discrimin analysi classif randomli project data robert durrant ata kaban random project conjunct classif specif analysi fisher linear discrimin fld classifi randomli project data space unlik previou analys classifi set avoid unnatur effect aris insist pairwis distanc approxim preserv project impos sparsiti underli low dimension structur constraint data advantag class structur inher problem obtain tight upper bound estim misclassif error averag random choic project contrast earli distanc preserv approach tighten natur number train exampl increas good generalis fld requir project dimens grow logarithm number class show error contribut covari misspecif wors low dimension space initi high dimension space contrast find previou relat work discuss insight 